Rational stochastic languages
نویسندگان
چکیده
The goal of the present paper is to provide a systematic and comprehensive study of rational stochastic languages over a semiring K ∈ {Q,Q,R,R}. A rational stochastic language is a probability distribution over a free monoid Σ which is rational over K, that is which can be generated by a multiplicity automata with parameters in K. We study the relations between the classes of rational stochastic languages S K (Σ). We define the notion of residual of a stochastic language and we use it to investigate properties of several subclasses of rational stochastic languages. Lastly, we study the representation of rational stochastic languages by means of multiplicity automata.
منابع مشابه
Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some class of probabilistic models such as probabilistic automata (PA). In this paper, we focus on probabilistic models based on multiplicity automata (MA). The stochastic languages generated by MA are called rational stocha...
متن کاملRelevant Representations for the Inference of Rational Stochastic Tree Languages
Recently, an algorithm DEESwas proposed for learning rational stochastic tree languages. Given a sample of trees independently and identically drawn according to a distribution de ned by a rational stochastic language, DEES outputs a linear representation of a rational series which converges to the target. DEES can then be used to identify in the limit with probability one rational stochastic t...
متن کاملLearning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference is to infer an estimate of P in some class of probabilistic models, such as Probabilistic Automata (PA). Here, we study the class S R (Σ) of rational stochastic languages, which consists in stochastic languages that c...
متن کاملLearning Rational Stochastic Tree Languages
We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T (F), from a sample of trees independently drawn according to an unknown target P . We consider the case where the target is a rational stochastic tree language, i.e. it can be computed by a rational tree series or, equivalently, by a multiplicity tree automaton. In this paper, we ...
متن کاملTesting for Stochastic Non- Linearity in the Rational Expectations Permanent Income Hypothesis
The Rational Expectations Permanent Income Hypothesis implies that consumption follows a martingale. However, most empirical tests have rejected the hypothesis. Those empirical tests are based on linear models. If the data generating process is non-linear, conventional tests may not assess some of the randomness properly. As a result, inference based on conventional tests of linear models can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0602093 شماره
صفحات -
تاریخ انتشار 2006